// 
//  Copyright (c) 2009, Christoph Heindl
//  All rights reserved.
// 
//  Redistribution and use in source and binary forms, with or without modification, are 
//  permitted provided that the following conditions are met:
// 
//  Redistributions of source code must retain the above copyright notice, this list of 
//  conditions and the following disclaimer. 
//  Redistributions in binary form must reproduce the above copyright notice, this list 
//  of conditions and the following disclaimer in the documentation and/or other materials 
//  provided with the distribution. 
//  Neither the name Christoph Heindl nor the names of its contributors may be used to endorse 
//  or promote products derived from this software without specific prior written permission.
// 
//  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS 
//  OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY 
//  AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR 
//  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
//  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 
//  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER 
//  IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 
//  OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// 

using System;
using NUnit.Framework;
using Accelerators;

namespace AcceleratorsTests
{
  
  
  [TestFixture()]
  public class TestPriorityQueue
  {
    
    [Test()]
    public void TestPush()
    {
      Random r = new Random(10);
      PriorityQueue<double, bool> q = new PriorityQueue<double, bool>();
      
      const int count = 10000;
      for (int i = 0; i < count; ++i) {
        q.Push(r.NextDouble(), false);
      }
      
      Assert.AreEqual(count, q.Count);
      double max = q.PeekPriority();
      while (q.Count > 0) {
        double p = q.PeekPriority(); q.Pop();
        Assert.GreaterOrEqual(p, max);
        max = p;
      }
    }
    
    [Test]
    [ExpectedException(typeof(InvalidOperationException))]
    public void TestPopEmpty() {
      PriorityQueue<double, bool> q = new PriorityQueue<double, bool>();
      q.Pop();
    }
    
    [Test]
    [ExpectedException(typeof(InvalidOperationException))]
    public void TestPeekEmpty() {
      PriorityQueue<double, bool> q = new PriorityQueue<double, bool>();
      q.Peek();
    }

  
    [Test]
    [ExpectedException(typeof(InvalidOperationException))]
    public void TestPeekPriorityEmpty() {
      PriorityQueue<double, bool> q = new PriorityQueue<double, bool>();
      q.PeekPriority();
    }
  }
}
